A New Power Saving Routing Algorithm For Delay Tolerant Networks

Delay tolerant networks (DTNs) are wireless networks with intermittent connections. Node mobility, limited radio range and power cause intermittency. These networks have different applications such as space searching, wild life tracking, military battlefields and etc. Conventional routing approaches are not practical in DTN because of intermittency. So, routing is a challenging matter. This paper proposes a new routing method called geographic destination (GD). It is a power saving method which tries to find a neighbor which is geographically closest to destination. Among the neighbors, one closer to destination will receive a number of copies from the source. This approach continues until the message reaches destination. After that, extra copies are excluded. This method reduces transitions for conveying data to decrease energy usage. Message drop and overhead have also decreased. Comparing GD to well known protocols such as PROPHET and ER, proves GD success in power saving and preserving